The adaptable choosability number grows with the choosability number
نویسندگان
چکیده
The adaptable choosability number of a multigraph G, denoted cha(G), is the smallest integer k such that every edge labeling of G and assignment of lists of size k to the vertices of G permits a list coloring of G in which no edge e = uv has both u and v colored with the label of e. We show that cha grows with ch, i.e. there is a function f tending to infinity such that cha(G) ≥ f(ch(G)).
منابع مشابه
Adapted List Coloring of Graphs and Hypergraphs
We introduce and study adapted list coloring of graphs and hypergraphs. This is a generalization of ordinary list coloring and adapted coloring, and has more applications than these. We prove that the upper bounds on the adaptable choosability of graphs and uniform hypergraphs in terms of maximum degree are sufficiently stronger than those on the ordinary choosability, while the bounds in terms...
متن کاملLeast conflict choosability
Given a multigraph, suppose that each vertex is given a local assignment of k colours to its incident edges. We are interested in whether there is a choice of one local colour per vertex such that no edge has both of its local colours chosen. The least k for which this is always possible given any set of local assignments we call the conflict choosability of the graph. This parameter is closely...
متن کاملOn generalized list colourings of graphs
Vizing [15] and Erdös et al. [8] independently introduce the idea of considering list-colouring and k-choosability. In the both papers the choosability version of Brooks’ theorem [4] was proved but the choosability version of Gallai’s theorem [9] was proved independently by Thomassen [14] and by Kostochka et al. [11]. In [3] some extensions of these two basic theorems to (P, k)-choosability hav...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملCircular choosability is rational
The circular choosability or circular list chromatic number of a graph is a list-version of the circular chromatic number, introduced by Mohar [4] and studied in [17, 2, 5, 7, 8, 15] and [10]. One of the nice properties that the circular chromatic number enjoys is that it is a rational number for all finite graphs G (see for instance [16]), and a fundamental question, posed by Zhu [17] and reit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 311 شماره
صفحات -
تاریخ انتشار 2011